Structural results for the control of queueing systems using event-based dynamic programming
نویسنده
چکیده
In this paper we study monotonicity results for optimal policies of various queueing and resource sharing models. The standard approach is to propagate, for each speciic model, certain properties of the dynamic programming value function. By concentrating on the events and the properties instead of on the value function we propose a uniied treatment of monotonicity results for Markovian models. This is illustrated with one and two-dimensional models.
منابع مشابه
A DSS-Based Dynamic Programming for Finding Optimal Markets Using Neural Networks and Pricing
One of the substantial challenges in marketing efforts is determining optimal markets, specifically in market segmentation. The problem is more controversial in electronic commerce and electronic marketing. Consumer behaviour is influenced by different factors and thus varies in different time periods. These dynamic impacts lead to the uncertain behaviour of consumers and therefore harden the t...
متن کاملA Multi-Stage Single-Machine Replacement Strategy Using Stochastic Dynamic Programming
In this paper, the single machine replacement problem is being modeled into the frameworks of stochastic dynamic programming and control threshold policy, where some properties of the optimal values of the control thresholds are derived. Using these properties and by minimizing a cost function, the optimal values of two control thresholds for the time between productions of two successive nonco...
متن کاملMulti-Objective Lead Time Control in Multistage Assembly Systems (TECHNICAL NOTE)
In this paper we develop a multi-objective model to optimally control the lead time of a multistage assembly system. The multistage assembly system is modeled as an open queueing network, whose service stations represent manufacturing or assembly operations. The arrival processes of the individual parts of the product, which should be assembled to each other in assembly stations, are assumed to...
متن کاملNew scheduling rules for a dynamic flexible flow line problem with sequence-dependent setup times
In the literature, the application of multi-objective dynamic scheduling problem and simple priority rules are widely studied. Although these rules are not efficient enough due to simplicity and lack of general insight, composite dispatching rules have a very suitable performance because they result from experiments. In this paper, a dynamic flexible flow line problem with sequence-dependent se...
متن کاملStructural Properties of a Class of Robust Inventory and Queueing Control Problems
In standard stochastic dynamic programming, the transition probability distributions of the underlying Markov Chains are assumed to be known with certainty. We focus on the case where the transition probabilities or other input data are uncertain. Robust dynamic programming addresses this problem by defining a min-max game between nature and the controller. Considering examples from inventory a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Queueing Syst.
دوره 30 شماره
صفحات -
تاریخ انتشار 1998